Solution of Large - Scale Lyapunov Equations via the Block Modified Smith Method

نویسندگان

  • John Sabino
  • Danny C. Sorensen
  • Noah G. Harding
چکیده

Solution of Large-Scale Lyapunov Equations via the Block Modified Smith Method by John Sabino Balanced truncation is an attractive method for reducing the dimension of mediumscale dynamical systems. Research in recent years has brought approximate balanced truncation to the large-scale setting. At the heart of this technique are alternating direction implicit (ADI) methods for solving large Lyapunov and Sylvester equations. This work concerns the convergence of these methods. Our primary objective is the practical solution of very large Lyapunov equations. Uncertainty in the selection of shifts for the ADI method and its variants has prevented the widespread adoption of an otherwise promising variant, the block modified Smith method. We examine in detail the role of shift selection, the fundamental minimax problem, and the often startling influence of nonnormality. Our analysis is tied intimately to the decay rate of the singular values of the solutions to these equations. We improve upon past bounds and develop new ones, including bounds based on pseudospectra. In the end, we provide simple yet effective schemes for finding shifts that outperform those produced by conventional selection strategies. To make effective use of these shifts, we provide insights that allow the block modified Smith method to be applied to very large equations in a practical setting. First, we give an error bound in terms of the drop tolerance that substantially improves upon ad hoc choices that could fail or demand excessive memory. Next, we improve the residual calculation in the method, which can be a surprisingly expensive computation. Finally, we provide guidance on the use of complex shifts, when to update the singular value decomposition, and the number of shifts to use. We have succeeded in providing a practical implementation of the block modified Smith method. The success of the algorithm is demonstrated in numerous experiments, culminating in the rapid solution of some of the largest known Lyapunov equations attempted on a workstation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low-rank Iterative Methods for Projected Generalized Lyapunov Equations

LOW-RANK ITERATIVE METHODS FOR PROJECTED GENERALIZED LYAPUNOV EQUATIONS TATJANA STYKEL Abstract. We generalize an alternating direction implicit method and the Smith method for large-scale projected generalized Lyapunov equations. Such equations arise in model reduction of descriptor systems. Low-rank versions of these methods are also presented, which can be used to compute low-rank approximat...

متن کامل

Approximate Solution of the Second Order Initial Value Problem by Using Epsilon Modified Block-Pulse Function

The present work approaches the problem of achieving the approximate solution of the second order initial value problems (IVPs) via its conversion into a Volterra integral equation of the second kind (VIE2). Therefore, we initially solve the IVPs using Runge–Kutta of the forth–order method (RK), and then convert it into VIE2, and apply the εmodified block–pulse functions (εMBPFs) and their oper...

متن کامل

Structure Preserving Iterative Solution of Periodic Projected Lyapunov Equations

We discuss the Smith iteration for solving large-scale sparse projected discrete-time periodic Lyapunov equations which arise in periodic state feedback problems and in model reduction of periodic descriptor systems. Two algorithms are presented in this paper. The first one works with the cyclic lifted representation of the corresponding projected discrete-time periodic Lyapunov equations. In t...

متن کامل

Numerical solution of system of linear integral equations via improvement of block-pulse functions

In this article, a numerical method based on  improvement of block-pulse functions (IBPFs) is discussed for solving the system of linear Volterra and Fredholm integral equations. By using IBPFs and their operational matrix of integration, such systems can be reduced to a linear system of algebraic equations. An efficient error estimation and associated theorems for the proposed method are also ...

متن کامل

Efficient iterative algorithms for linear stability analysis of incompressible flows

Linear stability analysis of a dynamical system entails finding the rightmost eigenvalue for a series of eigenvalue problems. For large-scale systems, it is known that conventional iterative eigenvalue solvers are not reliable for computing this eigenvalue. A more robust method recently developed in Elman & Wu (2012) and Meerbergen & Spence (2010), Lyapunov inverse iteraiton, involves solving l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006